On the Bi-enhancement of Chordal-bipartite Probe Graphs
نویسندگان
چکیده
Lately, a lot of research has been done on C -probe graphs. In this paper we focus on chordal-bipartite probe graphs. We prove a structural result that if B is a bipartite graph with no chordless cycle of length strictly greater than 6, then B is chordalbipartite probe if and only if a certain “enhanced” graph B∗ is a chordal-bipartite graph. This theorem is analogous to a result on interval probe graphs in [13] and to one on chordal probe graphs in [8].
منابع مشابه
Recognizing Chordal-Bipartite Probe Graphs
A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such thatG can be extended to a chordal-bipartite graph by adding edges between non-probes. A bipartite graph is called chordal-bipartite if it contains no chordless cycle of length strictly greater than 5. Such probe/non-probe completion problems have ...
متن کاملBi-Cohen-Macaulay graphs
In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General biCohen-Macaulay graphs are classified up to separation. The inseparable bi-CohenMacaulay graphs are determined. We establish a bijection between the set of all trees and the set of inseparable bi-Cohen-Macaulay graphs.
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملChordal bipartite graphs of bounded tree- and clique-width
A bipartite graph is chordal bipartite if every cycle of length at least six has a chord. In the class of chordal bipartite graphs the tree-width and the clique-width are unbounded. Our main results are that chordal bipartite graphs of bounded vertex degree have bounded tree-width and that k-fork-free chordal bipartite graphs have bounded clique-width, where a k-fork is the graph arising from a...
متن کاملThe Dilworth Number of Auto-Chordal-Bipartite Graphs
The mirror (or bipartite complement) mir(B) of a bipartite graph B = (X,Y,E) has the same color classes X and Y as B, and two vertices x ∈ X and y ∈ Y are adjacent in mir(B) if and only if xy / ∈ E. A bipartite graph is chordal bipartite if none of its induced subgraphs is a chordless cycle with at least six vertices. In this paper, we deal with chordal bipartite graphs whose mirror is chordal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 110 شماره
صفحات -
تاریخ انتشار 2008